2-Odd Labeling of Graphs Using Certain Number Theoretic Concepts and Graph Operations
نویسندگان
چکیده
Graph theory plays a significant role in variety of real-world systems. concepts such as labeling and coloring are used to depict processes relationships material, social, biological, physical, information Specifically, graph is communication network addressing, fault-tolerant system design, automatic channel allocation, etc. 2-odd assigns distinct integers the nodes manner, that positive difference adjacent either 2 or an odd integer, src=image/13427595_02.png>, src=image/13427595_03.png>. So, src=image/13427595_04.png> if only it permits labeling. Studying certain important modifications through various operations on given interesting challenging. These mainly modify underlying graph's structure, so understanding complex can be done over set graphs inevitable. The motivation behind development this article apply concept generated by using operations. Further, results also derived some well-known number theoretic Twin prime conjecture Goldbach's conjecture, besides recalling few applications coloring.
منابع مشابه
Some Graph Operations Of Even Vertex Odd Mean Labeling Graphs
A graph with p vertices and q edges is said to have an even vertex odd mean labeling if there exists an injective function f:V(G){0, 2, 4, ... 2q-2,2q} such that the induced map f*: E(G) {1, 3, 5, ... 2q-1} defined by f*(uv)= f u f v 2 is a bijection. A graph that admits an even vertex odd mean labeling is called an even vertex odd mean graph. In this paper we pay our attention to p...
متن کاملFurther results on odd mean labeling of some subdivision graphs
Let G(V,E) be a graph with p vertices and q edges. A graph G is said to have an odd mean labeling if there exists a function f : V (G) → {0, 1, 2,...,2q - 1} satisfying f is 1 - 1 and the induced map f* : E(G) → {1, 3, 5,...,2q - 1} defined by f*(uv) = (f(u) + f(v))/2 if f(u) + f(v) is evenf*(uv) = (f(u) + f(v) + 1)/2 if f(u) + f(v) is odd is a bijection. A graph that admits an odd mean labelin...
متن کاملCharacteristics of Common Neighborhood Graph under Graph Operations and on Cayley Graphs
Let G(V;E) be a graph. The common neighborhood graph (congraph) of G is a graph with vertex set V , in which two vertices are adjacent if and only if they have a common neighbor in G. In this paper, we obtain characteristics of congraphs under graph operations; Graph :::::union:::::, Graph cartesian product, Graph tensor product, and Graph join, and relations between Cayley graphs and its c...
متن کاملOdd Sum Labeling of Some Subdivision Graphs
An injective function f : V (G)→ {0, 1, 2, . . . , q} is an odd sum labeling if the induced edge labeling f∗ defined by f∗(uv) = f(u) + f(v), for all uv ∈ E(G), is bijective and f∗(E(G)) = {1, 3, 5, . . . , 2q − 1}. A graph is said to be an odd sum graph if it admits an odd sum labeling. In this paper, we have studied the odd sum property of the subdivision of the triangular snake, quadrilatera...
متن کاملOdd Graceful Labeling of Acyclic Graphs
Let G = (V, E) be a finite, simple and undirected graph. A graph G with q edges is said to be odd-graceful if there is an injection f : V (G) → {0, 1, 2, . . . , 2q− 1} such that, when each edge xy is assigned the label |f (x)− f (y)| , the resulting edge labels are {1, 3, 5, . . . , 2q− 1} and f is called an odd graceful labeling of G. Motivated by the work of Z. Gao [6] in which he studied th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics and Statistics
سال: 2022
ISSN: ['2332-2144', '2332-2071']
DOI: https://doi.org/10.13189/ms.2022.100419